Bounded delay L codes
نویسندگان
چکیده
منابع مشابه
Retrograde Codes and Bounded Synchronization Delay
We study how the concept of bounded synchronization delay is related to retrograde comma-free codes. Retrograde codes are a subclass of comma-free codes in which the dictionary of code words excludes not only overlaps of code words but also reversals of overlaps. We give a general upper bound on the maximum size of a retrograde comma-free distionary, provide a construction for a bounded synchro...
متن کاملUniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of...
متن کاملGray codes with bounded weights
Given a set H of binary vectors of length n, is there a cyclic listing of H so that every two successive vectors differ in a single coordinate? The problem of existence of such a listing, which is called a cyclic Gray code of H, is known to be NP-complete in general. The goal of this paper is therefore to specify boundaries between its intractability and polynomial decidability. For that purpos...
متن کاملCharacterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
In this paper we continue a classical work of Schützenberger on codes with bounded synchronization delay. He was interested to characterize those regular languages where the groups in the syntactic monoid belong to a variety H. He allowed operations on the language side which are union, intersection, concatenation and modified Kleene-star involving a mapping of a prefix code of bounded synchron...
متن کاملChurch-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions
What is the common link, if there is any, between Church-Rosser systems, prefix codes with bounded synchronization delay, and local Rees extensions? The first obvious answer is that each of these notions relates to topics of interest for WORDS: Church-Rosser systems are certain rewriting systems over words, codes are given by sets of words which form a basis of a free submonoid in the free mono...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90163-v